A Generalized Sylvester Identity and Fraction-free Random Gaussian Elimination
نویسندگان
چکیده
منابع مشابه
A Generalized Sylvester Identity and Fraction-free Random Gaussian Elimination
Sylvester's identity is a well-known identity which can be used to prove that certain Gaussian elimination algorithms are fraction-free. In this paper we will generalize Sylvester's identity and use it to prove that certain random Gaussian elimination algorithms are fraction-free. This can be used to yield fraction-free algorithms for solving Ax = b (x 0) and for the simplex method in linear pr...
متن کاملParametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination
Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints for the parameters. Among the tasks typically addressed in the analysis of parametric Markov chains are (1) the computation of closed-form solutions for reachabil...
متن کاملGeneralized free Gaussian white noise
Based on an adequate new Gel’fand triple, we construct the infinite dimensional free Gaussian white noise measure μ using the Bochner-Minlos theorem. Next, we give the chaos decomposition of an L2 space with respect to the measure μ .
متن کاملGeneralized Gaussian Random Fields using hidden selections
We study non-Gaussian random fields constructed by the selection normal distribution, and we term them selection Gaussian random fields. The selection Gaussian random field can capture skewness, multi-modality, and to some extend heavy tails in the marginal distribution. We present a Metropolis-Hastings algorithm for efficient simulation of realizations from the random field, and a numerical al...
متن کاملGenerating generalized inverse Gaussian random variates
The generalized inverse Gaussian distribution has become quite popular in financial engineering. The most popular random variate generator is due to Dagpunar (1989). It is an acceptance-rejection algorithm method based on the Ratio-of-uniforms method. However, it is not uniformly fast as it has a prohibitive large rejection constant when the distribution is close to the gamma distribution. Rece...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2001
ISSN: 0747-7171
DOI: 10.1006/jsco.2000.0409